Emergency Service Vehicle Location Problem with Batch Arrival of Demands

Authors

Abstract:

In this paper an emergency service vehicle (ESV) location problem has been considered in which it is assumed that each emergency call may require more than one ESV. In ESV location problem two factors should be known; the location of stations and the number of ESVs at each station. Hence, a nonlinear mixed integer programming model is presented in order to maximize the total response rate to the emergency calls. Moreover, a solution method based on genetic algorithm is provided and efficiency of the algorithm is evaluated with regard to the results from an exhaustive enumeration method. The model is applied to the real case study based on the data from Mashhad city to find the emergency gas stations and the required ESVs. Finally, a sensitivity analysis on the main parameters of the model is conducted and the managerial insights were reported. The results indicate that considering the fact that each call may require more than one ESV is very influential on the response rate and the assumption of each call requires just one ESV makes the results unrealistic.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Network Location Problem with Stochastic and Uniformly Distributed Demands

This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...

full text

Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands

The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...

full text

Facility Location Problem with Fuzzy Random Demands

Three types of fuzzy random programming for capacitated location-allocation problem with fuzzy random demands are proposed according to different criteria, including the expected value model, chanceconstrained programming and dependent-chance programming. Finally, integrating the network simplex algorithm, fuzzy random simulation and genetic algorithm, a hybrid intelligent algorithm is produced...

full text

Technical Note - Approximating Vehicle Dispatch Probabilities for Emergency Service Systems with Location-Specific Service Times and Multiple Units per Location

To calculate many of the important performance measures for an emergency response system one requires knowledge of the probability that a particular server will respond to an incoming call at a particular location. Estimating these “dispatch probabilities” is complicated by four important characteristics of emergency service systems. We discuss these characteristics and extend previous approxim...

full text

A taxonomy for emergency service station location problem

The emergency service station (ESS) location problem has been widely studied in the literature since 1970s. There has been a growing interest in the subject especially after 1990s. Various models with different objective functions and constraints have been proposed in the academic literature and efficient solution techniques have been developed to provide good solutions in reasonable times. How...

full text

Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands

Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 31  issue 8

pages  1240- 1249

publication date 2018-08-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023